Global solution of semi-infinite programs
نویسندگان
چکیده
A branch-and-bound procedure for the global solution of smooth, nonlinear SIPs has been developed. An upper-bounding problem is constructed using an inclusionconstrained reformulation of the infinite set of constraints, and a convex lowerbounding problem is derived from a discretized approximation of the SIP. Results are provided for a number of problems in the SIP literature.
منابع مشابه
Global optimization of generalized semi-infinite programs via restriction of the right hand side
The algorithm proposed in [Mitsos Optimization 2011] for the global optimization of semi-infinite programs is extended to the global optimization of generalized semi-infinite programs (GSIP). No convexity or concavity assumptions are made. The algorithm employs convergent lower and upper bounds which are based on regular (in general nonconvex) nonlinear programs (NLP) solved by a (black-box) de...
متن کاملA New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملA hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
A discretization-based algorithm for the global solution of semi-infinite programs (SIPs) is proposed, which is guaranteed to converge to a feasible, ε -optimal solution finitely under mild assumptions. The algorithm is based on the hybridization of two existing algorithms. The first algorithm [Mitsos, Optimization, 60(10-11):1291-1308, 2011] is based on a restriction of the right-hand side of ...
متن کاملGlobal Optimization Algorithms for Semi-Infinite and Generalized Semi-Infinite Programs
The goals of this thesis are the development of global optimization algorithms for semiinfinite and generalized semi-infinite programs and the application of these algorithms to kinetic model reduction. The outstanding issue with semi-infinite programming (SIP) was a methodology that could provide a certificate of global optimality on finite termination for SIP with nonconvex functions particip...
متن کاملSolvability of infinite system of nonlinear singular integral equations in the C(Itimes I, c) space and modified semi-analytic method to find a closed-form of solution
In this article, we discuss about solvability of infinite systems of singular integral equations with two variables in the Banach sequence space $C(I times I, c)$ by applying measure of noncompactness and Meir-Keeler condensing operators. By presenting an example, we have illustrated our results. For validity of the results we introduce a modified semi-analytic method in the case of tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 103 شماره
صفحات -
تاریخ انتشار 2005